TSTP Solution File: NUM687^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM687^4 : TPTP v8.1.2. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:56:16 EDT 2024
% Result : Theorem 0.40s 0.69s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 34
% Syntax : Number of formulae : 69 ( 33 unt; 20 typ; 0 def)
% Number of atoms : 214 ( 38 equ; 0 cnn)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 433 ( 33 ~; 23 |; 7 &; 332 @)
% ( 0 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 20 usr; 7 con; 0-3 aty)
% Number of variables : 100 ( 72 ^ 28 !; 0 ?; 100 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_23,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_25,type,
in: $i > $i > $o ).
thf(decl_61,type,
imp: $o > $o > $o ).
thf(decl_62,type,
d_not: $o > $o ).
thf(decl_67,type,
l_or: $o > $o > $o ).
thf(decl_72,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_77,type,
e_is: $i > $i > $i > $o ).
thf(decl_123,type,
nat: $i ).
thf(decl_124,type,
n_is: $i > $i > $o ).
thf(decl_127,type,
n_some: ( $i > $o ) > $o ).
thf(decl_142,type,
n_pl: $i > $i > $i ).
thf(decl_147,type,
diffprop: $i > $i > $i > $o ).
thf(decl_148,type,
d_29_ii: $i > $i > $o ).
thf(decl_149,type,
iii: $i > $i > $o ).
thf(decl_151,type,
moreis: $i > $i > $o ).
thf(decl_155,type,
esk1_0: $i ).
thf(decl_156,type,
esk2_0: $i ).
thf(decl_157,type,
esk3_0: $i ).
thf(decl_158,type,
esk4_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_imp) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_d_29_ii) ).
thf(def_l_or,axiom,
( l_or
= ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_l_or) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_e_is) ).
thf(def_moreis,axiom,
( moreis
= ( ^ [X1: $i,X229: $i] : ( l_or @ ( d_29_ii @ X1 @ X229 ) @ ( n_is @ X1 @ X229 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_moreis) ).
thf(def_n_some,axiom,
( n_some
= ( l_some @ nat ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_n_some) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_n_is) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_is_of) ).
thf(def_iii,axiom,
( iii
= ( ^ [X1: $i,X211: $i] : ( n_some @ ( diffprop @ X211 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',def_iii) ).
thf(satz22a,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X311: $i] : ( in @ X311 @ nat )
@ ^ [X312: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] :
( all_of
@ ^ [X13: $i] : ( in @ X13 @ nat )
@ ^ [X13: $i] :
( ( moreis @ X1 @ X312 )
=> ( ( d_29_ii @ X4 @ X13 )
=> ( d_29_ii @ ( n_pl @ X1 @ X4 ) @ ( n_pl @ X312 @ X13 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',satz22a) ).
thf(satz21a,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X309: $i] : ( in @ X309 @ nat )
@ ^ [X310: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] :
( all_of
@ ^ [X13: $i] : ( in @ X13 @ nat )
@ ^ [X13: $i] :
( ( iii @ X1 @ X310 )
=> ( ( iii @ X4 @ X13 )
=> ( iii @ ( n_pl @ X1 @ X4 ) @ ( n_pl @ X310 @ X13 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',satz21a) ).
thf(satz19f,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X277: $i] : ( in @ X277 @ nat )
@ ^ [X278: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] :
( ( iii @ X1 @ X278 )
=> ( iii @ ( n_pl @ X4 @ X1 ) @ ( n_pl @ X4 @ X278 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p',satz19f) ).
thf(c_0_14,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_15,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_16,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_17,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_18,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_19,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_20,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moreis]) ).
thf(c_0_21,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_16,def_n_some]) ).
thf(c_0_22,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17,c_0_15]),c_0_18]) ).
thf(c_0_23,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_19]) ).
thf(c_0_24,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_25,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_26,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z1 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_iii]) ).
thf(c_0_27,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).
thf(c_0_28,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_29,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z1 @ Z0 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_26,def_n_some]) ).
thf(c_0_30,negated_conjecture,
~ ! [X383: $i] :
( ( in @ X383 @ nat )
=> ! [X382: $i] :
( ( in @ X382 @ nat )
=> ! [X381: $i] :
( ( in @ X381 @ nat )
=> ! [X380: $i] :
( ( in @ X380 @ nat )
=> ( ( ( ( l_some @ nat @ ( diffprop @ X383 @ X382 ) )
=> ~ $true )
=> ( X383 = X382 ) )
=> ( ( l_some @ nat @ ( diffprop @ X381 @ X380 ) )
=> ( l_some @ nat @ ( diffprop @ ( n_pl @ X383 @ X381 ) @ ( n_pl @ X382 @ X380 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz22a])]),c_0_27]),c_0_21]),c_0_28]) ).
thf(c_0_31,plain,
! [X474: $i] :
( ( in @ X474 @ nat )
=> ! [X473: $i] :
( ( in @ X473 @ nat )
=> ! [X472: $i] :
( ( in @ X472 @ nat )
=> ! [X471: $i] :
( ( in @ X471 @ nat )
=> ( ( l_some @ nat @ ( diffprop @ X473 @ X474 ) )
=> ( ( l_some @ nat @ ( diffprop @ X471 @ X472 ) )
=> ( l_some @ nat @ ( diffprop @ ( n_pl @ X473 @ X471 ) @ ( n_pl @ X474 @ X472 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz21a]),c_0_29]),c_0_28]) ).
thf(c_0_32,negated_conjecture,
( ( in @ esk1_0 @ nat )
& ( in @ esk2_0 @ nat )
& ( in @ esk3_0 @ nat )
& ( in @ esk4_0 @ nat )
& ( ( l_some @ nat @ ( diffprop @ esk1_0 @ esk2_0 ) )
| ( esk1_0 = esk2_0 ) )
& ( $true
| ( esk1_0 = esk2_0 ) )
& ( l_some @ nat @ ( diffprop @ esk3_0 @ esk4_0 ) )
& ~ ( l_some @ nat @ ( diffprop @ ( n_pl @ esk1_0 @ esk3_0 ) @ ( n_pl @ esk2_0 @ esk4_0 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])])]) ).
thf(c_0_33,plain,
! [X654: $i,X655: $i,X656: $i,X657: $i] :
( ~ ( in @ X654 @ nat )
| ~ ( in @ X655 @ nat )
| ~ ( in @ X656 @ nat )
| ~ ( in @ X657 @ nat )
| ~ ( l_some @ nat @ ( diffprop @ X655 @ X654 ) )
| ~ ( l_some @ nat @ ( diffprop @ X657 @ X656 ) )
| ( l_some @ nat @ ( diffprop @ ( n_pl @ X655 @ X657 ) @ ( n_pl @ X654 @ X656 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])]) ).
thf(c_0_34,negated_conjecture,
~ ( l_some @ nat @ ( diffprop @ ( n_pl @ esk1_0 @ esk3_0 ) @ ( n_pl @ esk2_0 @ esk4_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_35,plain,
! [X1: $i,X4: $i,X6: $i,X5: $i] :
( ( l_some @ nat @ ( diffprop @ ( n_pl @ X4 @ X6 ) @ ( n_pl @ X1 @ X5 ) ) )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X5 @ nat )
| ~ ( in @ X6 @ nat )
| ~ ( l_some @ nat @ ( diffprop @ X4 @ X1 ) )
| ~ ( l_some @ nat @ ( diffprop @ X6 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_36,negated_conjecture,
l_some @ nat @ ( diffprop @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_37,negated_conjecture,
in @ esk3_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_38,negated_conjecture,
in @ esk4_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_39,negated_conjecture,
in @ esk1_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_40,negated_conjecture,
in @ esk2_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_41,negated_conjecture,
( ( l_some @ nat @ ( diffprop @ esk1_0 @ esk2_0 ) )
| ( esk1_0 = esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_42,negated_conjecture,
~ ( l_some @ nat @ ( diffprop @ esk1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]),c_0_38]),c_0_39]),c_0_40])]) ).
thf(c_0_43,plain,
! [X432: $i] :
( ( in @ X432 @ nat )
=> ! [X431: $i] :
( ( in @ X431 @ nat )
=> ! [X430: $i] :
( ( in @ X430 @ nat )
=> ( ( l_some @ nat @ ( diffprop @ X431 @ X432 ) )
=> ( l_some @ nat @ ( diffprop @ ( n_pl @ X430 @ X431 ) @ ( n_pl @ X430 @ X432 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz19f]),c_0_29]),c_0_28]) ).
thf(c_0_44,negated_conjecture,
esk2_0 = esk1_0,
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
thf(c_0_45,plain,
! [X613: $i,X614: $i,X615: $i] :
( ~ ( in @ X613 @ nat )
| ~ ( in @ X614 @ nat )
| ~ ( in @ X615 @ nat )
| ~ ( l_some @ nat @ ( diffprop @ X614 @ X613 ) )
| ( l_some @ nat @ ( diffprop @ ( n_pl @ X615 @ X614 ) @ ( n_pl @ X615 @ X613 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])])]) ).
thf(c_0_46,negated_conjecture,
~ ( l_some @ nat @ ( diffprop @ ( n_pl @ esk1_0 @ esk3_0 ) @ ( n_pl @ esk1_0 @ esk4_0 ) ) ),
inference(spm,[status(thm)],[c_0_34,c_0_44]) ).
thf(c_0_47,plain,
! [X5: $i,X4: $i,X1: $i] :
( ( l_some @ nat @ ( diffprop @ ( n_pl @ X5 @ X4 ) @ ( n_pl @ X5 @ X1 ) ) )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X5 @ nat )
| ~ ( l_some @ nat @ ( diffprop @ X4 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
thf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_36]),c_0_39]),c_0_37]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.16 % Problem : NUM687^4 : TPTP v8.1.2. Released v7.1.0.
% 0.13/0.17 % Command : run_E %s %d THM
% 0.17/0.39 % Computer : n015.cluster.edu
% 0.17/0.39 % Model : x86_64 x86_64
% 0.17/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39 % Memory : 8042.1875MB
% 0.17/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.39 % CPULimit : 300
% 0.17/0.39 % WCLimit : 300
% 0.17/0.39 % DateTime : Fri May 3 09:39:51 EDT 2024
% 0.17/0.39 % CPUTime :
% 0.24/0.56 Running higher-order theorem proving
% 0.24/0.56 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.b9Impsm9FZ/E---3.1_1267.p
% 0.40/0.69 # Version: 3.1.0-ho
% 0.40/0.69 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.40/0.69 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.69 # Starting lpo1_fix with 900s (3) cores
% 0.40/0.69 # Starting full_lambda_9 with 300s (1) cores
% 0.40/0.69 # Starting almost_fo_4 with 300s (1) cores
% 0.40/0.69 # Starting new_ho_9 with 300s (1) cores
% 0.40/0.69 # Starting pre_casc_4 with 300s (1) cores
% 0.40/0.69 # Starting ho_unfolding_6 with 300s (1) cores
% 0.40/0.69 # full_lambda_9 with pid 1429 completed with status 0
% 0.40/0.69 # Result found by full_lambda_9
% 0.40/0.69 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.40/0.69 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.69 # Starting lpo1_fix with 900s (3) cores
% 0.40/0.69 # Starting full_lambda_9 with 300s (1) cores
% 0.40/0.69 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.40/0.69 # Search class: HGHSM-FSLM32-DHSMMSBN
% 0.40/0.69 # partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.40/0.69 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.69 # Starting full_lambda_5 with 25s (1) cores
% 0.40/0.69 # full_lambda_5 with pid 1445 completed with status 0
% 0.40/0.69 # Result found by full_lambda_5
% 0.40/0.69 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.40/0.69 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.69 # Starting lpo1_fix with 900s (3) cores
% 0.40/0.69 # Starting full_lambda_9 with 300s (1) cores
% 0.40/0.69 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.40/0.69 # Search class: HGHSM-FSLM32-DHSMMSBN
% 0.40/0.69 # partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.40/0.69 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.69 # Starting full_lambda_5 with 25s (1) cores
% 0.40/0.69 # Preprocessing time : 0.006 s
% 0.40/0.69 # Presaturation interreduction done
% 0.40/0.69
% 0.40/0.69 # Proof found!
% 0.40/0.69 # SZS status Theorem
% 0.40/0.69 # SZS output start CNFRefutation
% See solution above
% 0.40/0.69 # Parsed axioms : 391
% 0.40/0.69 # Removed by relevancy pruning/SinE : 263
% 0.40/0.69 # Initial clauses : 340
% 0.40/0.69 # Removed in clause preprocessing : 175
% 0.40/0.69 # Initial clauses in saturation : 165
% 0.40/0.69 # Processed clauses : 354
% 0.40/0.69 # ...of these trivial : 5
% 0.40/0.69 # ...subsumed : 83
% 0.40/0.69 # ...remaining for further processing : 266
% 0.40/0.69 # Other redundant clauses eliminated : 20
% 0.40/0.69 # Clauses deleted for lack of memory : 0
% 0.40/0.69 # Backward-subsumed : 0
% 0.40/0.69 # Backward-rewritten : 5
% 0.40/0.69 # Generated clauses : 732
% 0.40/0.69 # ...of the previous two non-redundant : 704
% 0.40/0.69 # ...aggressively subsumed : 0
% 0.40/0.69 # Contextual simplify-reflections : 1
% 0.40/0.69 # Paramodulations : 543
% 0.40/0.69 # Factorizations : 2
% 0.40/0.69 # NegExts : 2
% 0.40/0.69 # Equation resolutions : 26
% 0.40/0.69 # Disequality decompositions : 0
% 0.40/0.69 # Total rewrite steps : 144
% 0.40/0.69 # ...of those cached : 127
% 0.40/0.69 # Propositional unsat checks : 0
% 0.40/0.69 # Propositional check models : 0
% 0.40/0.69 # Propositional check unsatisfiable : 0
% 0.40/0.69 # Propositional clauses : 0
% 0.40/0.69 # Propositional clauses after purity: 0
% 0.40/0.69 # Propositional unsat core size : 0
% 0.40/0.69 # Propositional preprocessing time : 0.000
% 0.40/0.69 # Propositional encoding time : 0.000
% 0.40/0.69 # Propositional solver time : 0.000
% 0.40/0.69 # Success case prop preproc time : 0.000
% 0.40/0.69 # Success case prop encoding time : 0.000
% 0.40/0.69 # Success case prop solver time : 0.000
% 0.40/0.69 # Current number of processed clauses : 137
% 0.40/0.69 # Positive orientable unit clauses : 20
% 0.40/0.69 # Positive unorientable unit clauses: 0
% 0.40/0.69 # Negative unit clauses : 11
% 0.40/0.69 # Non-unit-clauses : 106
% 0.40/0.69 # Current number of unprocessed clauses: 625
% 0.40/0.69 # ...number of literals in the above : 3268
% 0.40/0.69 # Current number of archived formulas : 0
% 0.40/0.69 # Current number of archived clauses : 117
% 0.40/0.69 # Clause-clause subsumption calls (NU) : 5391
% 0.40/0.69 # Rec. Clause-clause subsumption calls : 1398
% 0.40/0.69 # Non-unit clause-clause subsumptions : 80
% 0.40/0.69 # Unit Clause-clause subsumption calls : 90
% 0.40/0.69 # Rewrite failures with RHS unbound : 0
% 0.40/0.69 # BW rewrite match attempts : 5
% 0.40/0.69 # BW rewrite match successes : 1
% 0.40/0.69 # Condensation attempts : 0
% 0.40/0.69 # Condensation successes : 0
% 0.40/0.69 # Termbank termtop insertions : 63529
% 0.40/0.69 # Search garbage collected termcells : 16465
% 0.40/0.69
% 0.40/0.69 # -------------------------------------------------
% 0.40/0.69 # User time : 0.089 s
% 0.40/0.69 # System time : 0.011 s
% 0.40/0.69 # Total time : 0.100 s
% 0.40/0.69 # Maximum resident set size: 4812 pages
% 0.40/0.69
% 0.40/0.69 # -------------------------------------------------
% 0.40/0.69 # User time : 0.100 s
% 0.40/0.69 # System time : 0.014 s
% 0.40/0.69 # Total time : 0.114 s
% 0.40/0.69 # Maximum resident set size: 2360 pages
% 0.40/0.69 % E---3.1 exiting
% 0.40/0.69 % E exiting
%------------------------------------------------------------------------------